The Public Collaboration Lab—Infrastructuring Redundancy with Communities-in-Place
نویسندگان
چکیده
منابع مشابه
the place of iranian public diplomacy in central asia
چکیده: نسبت به کارکرد و ماهیت دیپلماسی عمومی در جهان امروز نظریه های متعددی بیان گردیده و جایگاه آن در کنار نظریه های دیگر در محافل آکادمیک و دانشگاهی بررسی و تحلیل گردیده است. نظر به اهمیت دیپلماسی عمومی و جایگاه آن در سیاست خارجی ایران این نوشتار با تمرکز بر دیپلماسی عمومی در منطقه آسیای مرکزی تهیه و تنظیم شده است. این ضرورت از آنجا ناشی می شود که اولاً مفهوم دیپلماسی عمومی در سیاست خارجی ای...
15 صفحه اولthe impact of e-readiness on ec success in public sector in iran the impact of e-readiness on ec success in public sector in iran
acknowledge the importance of e-commerce to their countries and to survival of their businesses and in creating and encouraging an atmosphere for the wide adoption and success of e-commerce in the long term. the investment for implementing e-commerce in the public sector is one of the areas which is focused in government‘s action plan for cross-disciplinary it development and e-readiness in go...
Redundancy and Collaboration in Wikibooks
This paper investigates how Wikibooks authors collaborate to create high-quality books. We combined Information Retrieval and statistical techniques to examine the complete multi-year lifecycle of over 50 high-quality Wikibooks. We found that: 1. The presence of redundant material is negatively correlated with collaboration mechanisms; 2. For most books, over 50% of the content is written by a ...
متن کاملCommunities of practice foster collaboration across public health
Purpose – The complexity and responsibilities of public health make collaboration across multiple levels of government critical. The Centers for Disease Control and Prevention (CDC) effectively uses communities of practice (CoPs) to bring its staff together with partners to share, learn, and address public health problems. This paper aims to focus on CoPs. Design/methodology/approach – The pape...
متن کاملIn-Place Calculation of Minimum-Redundancy Codes
The optimal prefix-free code problem is to determine, for a given array p = [p~li 9 {1.. . n}] of n weights, an integer array l -[l~ I i 9 {1.. . n}] of n codeword lengths such that ~ 1 2-~' ~ 1 and ~i~=1 pil~ is minimized. Huff-man's famous greedy algorithm solves this problem in O(n log n) time, if p is unsorted; and can be implemented to execute in O(n) time, if the input array p is sorted. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: She Ji: The Journal of Design, Economics, and Innovation
سال: 2018
ISSN: 2405-8726
DOI: 10.1016/j.sheji.2018.02.008